Arbitrary Threshold Widths for Monotone , Symmetric Properties
نویسنده
چکیده
We investigate the threshold widths of some symmetric properties which range asymptotically between 1/ √ n and 1/ log n. These properties are built using a combination of failure sets arising from reliability theory. This combination of sets is simply called a product. Some general results on the threshold width of the product of two sets A and B in terms of the threshold locations and widths of A and B are provided.
منابع مشابه
Threshold for Monotone Symmetric Properties through a Logarithmic Sobolev Inequality
Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576–1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017–1054]. The general upper bound for the threshold width of symmetric monotone properties is improved. This follows from a new lower bound on the maximal influence of a variable on a Boolean function. The method of proo...
متن کاملProbabilistic Construction of Monotone Formulae for Positive Linear Threshold Functions
We extend Valiant's construction of monotone formulae for the majority function to obtain an eecient probabilistic construction of small monotone formulae for arbitrary positive linear threshold functions. We show that any positive linear threshold function on n boolean variables which has weight complexity q(n) can be computed by a monotone boolean formula of size O(q(n) 3:3 n 2): Our techniqu...
متن کاملEvery Monotone Graph Property Has a Sharp Threshold Ehud Friedgut and Gil Kalai
In their seminal work which initiated random graph theory Erd os and R enyi discovered that many graph properties have sharp thresholds as the number of vertices tends to in nity We prove a conjecture of Linial that every monotone graph property has a sharp threshold This follows from the following theorem Let Vn p f g denote the Hamming space endowed with the probability measure p de ned by p ...
متن کاملSharp Thresholds of Graph properties and the k sat Problem
Given a monotone graph property P consider p P the proba bility that a random graph with edge probability p will have P The function d p P dp is the key to understanding the threshold behavior of the property P We show that if d p P dp is small corresponding to a non sharp threshold then there is a list of graphs of bounded size such that P can be approximated by the property of having one of t...
متن کاملOn limit cycles of monotone functions with symmetric connection graph
We study the length of the limit cycles of discrete monotone functions with symmetric connection graph. We construct a family of monotone functions such that the limit cycles are of maximum possible length, which is exponential in the number of variables. Furthermore, we prove for the class of monotone functions with more than two states and connection graph equal to a caterpillar that the leng...
متن کامل